Memory-efficient state lookups with fast updates

Routers must do a best matching pre x lookup for every packet � solutions for Gigabit speeds are well known. As Internet link speeds higher, we seek a scalable solution whose speed scales with memory speeds while allowing large prex databases. In this paper we show that providing such a solution requires careful attention to memory allocation and pipelining. This is because fast lookups require on-chip or o-chip SRAM which islimitedby either expense or manufacturing process. We show that doing so while providing guarantees on the number of pre xes supported requires new algorithms and the breaking down of traditional abstraction boundaries between hardware and software. We introduce new problem-speci c memory allocators that have provable memory utilization guarantees that can reach 100% � this is contrast to all standard allocators that can only guarantee 20 % utilization when the requests can come in the range [1:::32]. An optimal version of our algorithm requires a new (but feasible) SRAM memory design that allows shifted access in addition to normal word access. Our techniques generalize to other IP lookup schemes and to other state lookups besides pre x lookup. 1

Algorithms for Optimizing Leveled Commitment Contracts

In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts---i.e. contracts where each party can decommit by paying a predetermined penalty--- were recently shown to improve Pareto efficiency even if agents rationally decommit in Nash equilibrium using inflated thresholds on how good their outside offers must be before they decommit. This paper operationalizes the four leveled commitment contracting protocols by presenting algorithms for using them. Algorithms are presented for computing the Nash equilibrium decommitting thresholds and decommitting probabilities given the contract price and the penalties. Existence and uniqueness of the equilibrium are analyzed. Algorithms are also presented for optimizing the contract itself (price and penalties). Existence and uniqueness of the optimum are analyzed. Using the algorithms we offer a contract optimization service on the web as part of eMediator, our next..

Consensus and evidence-based Indian initiative on obstructive sleep apnea guidelines 2014 (first edition)

Obstructive sleep apnea (OSA) and obstructive sleep apnea syndrome (OSAS) are subsets of sleep-disordered breathing. Awareness about OSA and its consequences among the general public as well as the majority of primary care physicians across India is poor. This necessitated the development of the Indian initiative on obstructive sleep apnea (INOSA) guidelines under the auspices of Department of Health Research, Ministry of Health and Family Welfare, Government of India. OSA is the occurrence of an average five or more episodes of obstructive respiratory events per hour of sleep with either sleep-related symptoms or co-morbidities or ≥15 such episodes without any sleep-related symptoms or co-morbidities. OSAS is defined as OSA associated with daytime symptoms, most often excessive sleepiness. Patients undergoing routine health check-up with snoring, daytime sleepiness, obesity, hypertension, motor vehicular accidents, and high-risk cases should undergo a comprehensive sleep evaluation. Medical examiners evaluating drivers, air pilots, railway drivers, and heavy machinery workers should be educated about OSA and should comprehensively evaluate applicants for OSA. Those suspected to have OSA on comprehensive sleep evaluation should be referred for a sleep study. Supervised overnight polysomnography is the "gold standard" for evaluation of OSA. Positive airway pressure (PAP) therapy is the mainstay of treatment of OSA. Oral appliances (OA) are indicated for use in patients with mild to moderate OSA who prefer OA to PAP, or who do not respond to PAP or who fail treatment attempts with PAP or behavioral measures. Surgical treatment is recommended in patients who have failed or are intolerant to PAP therapy